On graphs with equal total domination and connected domination numbers
نویسندگان
چکیده
منابع مشابه
On graphs with equal total domination and connected domination numbers
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt (G) of G is the minimum cardinality taken over all total dominating sets of G. A dominating set is called a connected dominating set if the induced subgraph 〈S〉 is connected. The connected domination number γc(G) of G is the minimum cardinality taken over all min...
متن کاملOn graphs with equal domination and 2-domination numbers
Theorem 3. (Hansberg, Volkmann [4], 2007) Let G be a cactus graph. Then γ2(G) = γ(G) if and only if G is a C4-cactus. Let H be the family of graphs such that G ∈ H if and only if either G arises from a cartesian product Kp ×Kp of two complete graphs of order p for an integer p ≥ 3 by inflating every vertex but the ones on a transversal to a clique of arbitrary order, or G is a claw-free graph w...
متن کاملTrees with equal total domination and game total domination numbers
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453–1462], where the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are neighbors. This process eventually produces a t...
متن کاملTrees with Equal Total Domination and Total Restrained Domination Numbers
For a graph G = (V, E), a set S ⊆ V (G) is a total dominating set if it is dominating and both 〈S〉 has no isolated vertices. The cardinality of a minimum total dominating set in G is the total domination number. A set S ⊆ V (G) is a total restrained dominating set if it is total dominating and 〈V (G) − S〉 has no isolated vertices. The cardinality of a minimum total restrained dominating set in ...
متن کاملOn Graphs with Equal Chromatic Transversal Domination and Connected Domination Numbers
Let G = (V, E) be a graph with chromatic number χ(G). A dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every χ-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by γct(G). In this paper we characterize the class of trees, unicyclic graphs and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2006
ISSN: 0893-9659
DOI: 10.1016/j.aml.2005.06.016